Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs
نویسنده
چکیده
A parallel algorithm to recognize cographs with a linear processor bound and a log’ II time bound is presented. This result extends the result of Adhar and Peng (1990). Moreover, we get a better time processor product than the algorithm of Lin and Olariu (199 I ). As a consequence distance hereditary graphs can be recognized by the same processor and time bound.
منابع مشابه
Efficient parallel recognition of cographs
In this paper, we establish structural properties for the class of complement reducible graphs or cographs, which enable us to describe efficient parallel algorithms for recognizing cographs and for constructing the cotree of a graph if it is a cograph; if the input graph is not a cograph, both algorithms return an induced P4. For a graph on n vertices andm edges, both our cograph recognition a...
متن کاملOn Some Cograph Extensions and Their Algorithms
This paper reviews some classes of graphs related to cographs. The characterization of cographs by which there is no induced path on three edges (P4) is relaxed in various ways. Considered are classes of graphs that are uniquely representable by trees. Three such classes studied here are: P4-reducible, P4-sparse and P4-extendible graphs. In addition, we show that the class of P4-lite graphs has...
متن کاملDecycling a Graph by the Removal of a Matching: Characterizations for Special Classes
A graph G is matching-decyclable if it has a matching M such that G−M is acyclic. Deciding whether G is matching-decyclable is an NPcomplete problem even if G is 2-connected, planar, and subcubic. In this work we present characterizations of matching-decyclability in the following classes: chordal graphs, split graphs, distance-hereditary graphs, cographs, and Hamiltonian subcubic graphs. All t...
متن کاملA simple paradigm for graph recognition: application to cographs and distance hereditary graphs
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملRecognizing cographs and threshold graphs through a classification of their edges
In this work, we attempt to establish recognition properties and characterization for two classes of perfect graphs, namely cographs and threshold graphs, leading to constant-time parallel recognition algorithms. We classify the edges of an undirected graph as either free, semi-free or actual, and define the class of A-free graphs as the class containing all the graphs with no actual edges. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 57 شماره
صفحات -
تاریخ انتشار 1995